On generalized max-linear models in max-stable random fields
نویسندگان
چکیده
منابع مشابه
Extremal shot noises, heavy tails and max-stable random fields
We consider the extremal shot noise defined by M(y) = sup{mh(y − x); (x,m) ∈ Φ}, where Φ is a Poisson point process on R × (0,+∞) with intensity λdxG(dm) and h : R → [0,+∞] is a measurable function. Extremal shot noises naturally appear in extreme value theory as a model for spatial extremes and serve as basic models for annual maxima of rainfall or for coverage field in telecommunications. In ...
متن کاملOn Optimal Exact Simulation of Max-stable and Related Random Fields on a Compact Set
We consider the random field M(t) = sup n≥1 { − logAn +Xn(t) } , t ∈ T , for a set T ⊂ R, where (Xn) is an iid sequence of centered Gaussian random fields on T and 0 < A1 < A2 < · · · are the arrivals of a general renewal process on (0,∞), independent of (Xn). In particular, a large class of max-stable random fields with Gumbel marginals have such a representation. Assume that one needs c (d) =...
متن کاملMax-stable Models for Multivariate Extremes
• Multivariate extreme-value analysis is concerned with the extremes in a multivariate random sample, that is, points of which at least some components have exceptionally large values. Mathematical theory suggests the use of max-stable models for univariate and multivariate extremes. A comprehensive account is given of the various ways in which max-stable models are described. Furthermore, a co...
متن کاملRandom tessellations associated with max-stable random elds
With any max-stable random process η on X = Zd or Rd, we associate a random tessellation of the parameter space X . The construction relies on the Poisson point process representation of the max-stable process η which is seen as the pointwise maximum of a random collection of functions Φ = {φi, i ≥ 1}. The tessellation is constructed as follows: two points x, y ∈ X are in the same cell if and o...
متن کاملRandom Max 2-sat and Max Cut
Given a 2-SAT formula F consisting of n variables and b n random clauses, what is the largest number of clauses maxF satisfiable by a single assignment of the variables? We bound the answer away from the trivial bounds of 34 n and n. We prove that for < 1, the expected number of clauses satisfiable is b n o(1); for large , it is ( 34 + (p ))n; for = 1 + ", it is at least (1 + " O("3))n and at m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2017
ISSN: 0021-9002,1475-6072
DOI: 10.1017/jpr.2017.35